Learning Automata and Need-based Drive Reduction

This paper describes the instantiation of a type of Learning Automata (LA) that is all but unknown. Derived from the later theories of Alan Turing the LA is a dynamic, artifactual model of natural intelligence that uses cybernetic theory to derive machine intelligence. Similarly, the bibliographic references cited here may be unknown to readers unfamiliar with this branch of self-organizing (cybernetic) systems research. Simply put, this research is based on an algorithm described by Turing and named by him the P-Type unorganized machine. The research instantiates the P-Type algorithm in a multi-agent system (MAS) and explores its potential for extensibility. The only other known experiment that used a P-Type machine as a system controller (excluding the work of Turing) instantiated the LA in a single agent system. The current work builds upon that previous experiment; also described here.